Delay Bounds of a Dynamic Priority Queueing Scheme: Single Node Case
نویسنده
چکیده
The issue of providing deterministic delay guarantee using the Dynamic Priority Queueing (DPQ) scheme to support multiple connections at a single server queue is investigated. The novelty of our approach lies in that the delay bound is derived without making any assumptions about the traac characteristics of the connections. We rst show that the DPQ server provides a delay bound comparable to that of the PGPS server in a single node and then improve the delay bound by incorporating a peak rate constraint on the connections. The results reveal the possibility of using the DPQ scheme to support integrated services, including real-time applications in a B-ISDN/ATM network.
منابع مشابه
Delay Bounds of a Dynamic Priority Queueing Scheme : Single Node
The issue of providing deterministic delay guarantee using the Dynamic Priority Queueing (DPQ) scheme to support multiple connections at a single server queue is investigated. The novelty of our approach lies in that the delay bound is derived without making any assumptions about the traac characteristics of the connections. We rst show that the DPQ server provides a delay bound comparable to t...
متن کاملOn Average and Worst Case Behaviour in Non-Preemptive Priority Queueing
In this paper, we derive worst case bounds on delay and backlog for non-preemptive priority queueing systems using network calculus. There are known results for the average behaviour of non-preemptive priority queueing systems from traditional queueing theory. By use of numerical investigations, we compare our worst case bounds to those average behaviour results in order to give a feel as to ho...
متن کاملA New Circuit Scheme for Wide Dynamic Circuits
In this paper, a new circuit scheme is proposed to reduce the power consumption of dynamic circuits. In the proposed circuit, an NMOS keeper transistor is used to maintain the voltage level in the output node against charge sharing, leakage current and noise sources. Using the proposed keeper scheme, the voltage swing on the dynamic node is lowered to reduce the power consumption of wide fan-in...
متن کاملEfficient Dynamic Multilevel Priority Task Scheduling For Wireless Sensor Networks
ABSTRACT: Most of the existing packet-scheduling mechanism of WSN use First Come First Served(FCFS),nonpreemptive priority and preemptive prior it scheduling algorithms. These algorithms incur a high processing overhead and long end-to-end data transmission delay due to improper allocation of data packets to queues in multilevel queue scheduling algorithms. Moreover, these algorithms are not dy...
متن کاملDMP Packet Scheduling For Wireless Sensor Network
Most of the existing packet scheduling mechanisms of the wireless sensor network use First Come First Served (FCFS) non pre emptive priority and pre emptive priority scheduling algorithms. The above algorithms have high processing overhead and also long end-to-end data transmission delay. In FCFS concept the data packet which is entering the node first will go out first from the node, and the p...
متن کامل